<title>兔子繁殖</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cm">/*</span>
<span class="pl-cm">3 5</span>
<span class="pl-cm">*/</span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">(){</span>
        <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;rabbit.in&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span><span class="pl-n">stdin</span><span class="pl-p">);</span>
        <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;rabbit.out&quot;</span><span class="pl-p">,</span><span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span><span class="pl-n">stdout</span><span class="pl-p">);</span>
        <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">nm</span><span class="pl-p">[</span><span class="pl-mi">22</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-p">{</span><span class="pl-mi">0</span><span class="pl-p">};</span>
        <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">na</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span>
        <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-n">d</span><span class="pl-p">;</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld%lld&quot;</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">,</span><span class="pl-o">&amp;</span><span class="pl-n">d</span><span class="pl-p">);</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;</span><span class="pl-n">d</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
                <span class="pl-n">na</span><span class="pl-o">+=</span><span class="pl-n">nm</span><span class="pl-p">[</span><span class="pl-n">m</span><span class="pl-p">];</span>
                <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">new_r</span><span class="pl-o">=</span><span class="pl-n">na</span><span class="pl-p">;</span>
                <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">j</span><span class="pl-o">=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">&gt;=</span><span class="pl-mi">2</span><span class="pl-p">;</span><span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">){</span>
                        <span class="pl-n">nm</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">nm</span><span class="pl-p">[</span><span class="pl-n">j</span><span class="pl-o">-</span><span class="pl-mi">1</span><span class="pl-p">];</span>           
                <span class="pl-p">}</span>
                <span class="pl-n">nm</span><span class="pl-p">[</span><span class="pl-mi">1</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">new_r</span><span class="pl-p">;</span>
        <span class="pl-p">}</span>
        <span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">s</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
        <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">long</span> <span class="pl-kt">long</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
                <span class="pl-n">s</span><span class="pl-o">+=</span><span class="pl-n">nm</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
        <span class="pl-p">}</span>
        <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%lld</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span><span class="pl-n">s</span><span class="pl-o">+</span><span class="pl-n">na</span><span class="pl-p">);</span>
        <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>